On strong duality in linear copositive programming

The paper is dedicated to the study of strong duality for a problem linear copositive programming. Based on recently introduced concept set normalized immobile indices, an extended dual deduced. satisfies relations and does not require any additional regularity assumptions such as constraint qualifications. main difference with previously obtained results consists in fact that now uses neither indices themselves nor explicit information about convex hull these indices. formulations presented problems have similar structure properties proposed works by M. Ramana, L. Tuncel, H. Wolkowicz, semidefinite